A new approach for AntNet routing

✝ This work was partially supported by a DIPRI Research Grant of the National University of Asuncion. Abstract-AntNet is a new algorithm for packet routing in communication networks, firstly proposed by M. Dorigo and G. Di Caro (1997). In AntNet, a group of mobile agents (artificial ants) build paths between pair of nodes, exploring the network concurrently and exchanging data to update routing tables. This work analyzes AntNet algorithms and proposes improvements, comparing their performance with respect to the original AntNet and other commercial algorithms like RIP and OSPF. The simulation results indicate a better throughput (amount of packages successfully routed per unit time) of the improved proposals. As for packet delay, the improved proposals overcame the original AntNet, although RIP and OSPF were unbeatable in this measure of performance. Due to the increase in the number of users in networks like Internet, it may be expected that network service administrators will prioritize throughput (amount of service that could be offered in a given moment), for to maximize services to growing number of users. So, AntNet and its variant here proposed are promising options for routing in large public networks such as Internet.